منابع مشابه
Call Tree Reversal is NP-Complete
The data-flow of a numerical program is reversed in its adjoint. We discuss the combinatorial optimization problem that aims to find optimal checkpointing schemes at the level of call trees. For a given amount of persistent memory the objective is to store selected arguments and/or results of subroutine calls such that the overall computational effort (the total number of floating-point operati...
متن کاملDAG-width is PSPACE-complete
Berwanger et al. show in [BDH+12] that for every graph G of size n and DAGwidth k there is a DAG decomposition of width k of size nO(k). This gives a polynomial time algorithm for determining the DAG-width of a graph for any fixed k. However, if the DAG-width of the graphs from a class is not bounded, such algorithms become exponential. This raises the question whether we can always find a DAG ...
متن کاملOverloading is NP - complete
We show that overloading is NP-complete. This solves exercise 6.25 in the 1986 version of the Dragon book.
متن کاملMastermind is NP-Complete
In this paper we show that the Mastermind Satisfiability Problem (MSP) is NPcomplete. Mastermind is a popular game which can be turned into a logical puzzle called the Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle [5]. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an ...
متن کاملBLOCKSUM is NP-Complete
SUMMARY BlockSum, also known as KeisanBlock in Japanese, is a Latin square filling type puzzle, such as Sudoku. In this paper, we prove that the decision problem whether a given instance of BlockSum has a solution or not is NP-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2009
ISSN: 1570-8667
DOI: 10.1016/j.jda.2008.09.008